cycle path

См. также в других словарях:

• cycle path — cycle paths N COUNT A cycle path is a special path on which people can travel by bicycle separately from motor vehicles …   English dictionary

• cycle path — n BrE a path for bicycles, for example beside a road or in a park …   Dictionary of contemporary English

• Cycle path debate — The cycle path debate concerns the issues surrounding the provision and use of cycle paths. A cycle path or bike path is a track or road designated for use by cyclists that is physically separated from roads used by motor vehicles. It may be… …   Wikipedia

• cycle path — noun A path, segregated from other traffic, for the use of riders of bicycles …   Wiktionary

• West Loch Lomond Cycle Path — cite web|url=http://www.lochlomond trossachs.org/park/default.asp?p=23|title=West Loch Lomond Cycle Path Update August 2005|work=Loch Lomond amp; The Trossachs National Park] The path is about 28 kilometers (16.5 miles) long, and runs along the… …   Wikipedia

• Ebury Way Cycle Path — Infobox Hiking trail Name=Ebury Way Cycle Path Photo= Ebury Way.jpg Caption= Location=Hertfordshire, England Designation= Length=convert|3.5|mi|abbr=on Start/End Points=Rickmansworth, Watford Use=Cycling, Hiking ElevChange= HighPoint= LowPoint=… …   Wikipedia

• Cycle Friendly Awards — Trophies for the winners of the five categories of the 2009 Cycle Friendly Awards The New Zealand Cycle Friendly Awards were devised by the Cycling Advocates Network (CAN) in 2003. The purpose of the awards is to acknowledge and celebrate some of …   Wikipedia

• Path (graph theory) — In graph theory, a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence. The first vertex is called the start vertex and the last vertex is called the end vertex . Both… …   Wikipedia

• Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a …   Wikipedia

• Cycle (graph theory) — In graph theory, the term cycle may refer to a closed path. If repeated vertices are allowed, it is more often called a closed walk. If the path is a simple path, with no repeated vertices or edges other than the starting and ending vertices, it… …   Wikipedia

• path — noun 1 way across land ADJECTIVE ▪ long ▪ narrow ▪ steep ▪ winding ▪ cobblestone (esp. AmE), dirt …   Collocations dictionary